un 2 00 1 Extended Ensemble Monte

نویسنده

  • Yukito Iba
چکیده

" Extended Ensemble Monte Carlo " is a generic term that indicates a set of algorithms which are now popular in a variety of fields in physics and statistical information processing. Exchange Monte Carlo (Metropolis-Coupled Chain, Parallel Tempering), Simulated Tempering (Expanded Ensemble Monte Carlo), and Multicanonical Monte Carlo (Adaptive Umbrella Sampling) are typical members of this family. Here we give a cross-disciplinary survey of these algorithms with special emphasis on the great flexibility of the underlying idea. In Sec. 2, we discuss the background of Extended Ensemble Monte Carlo. In Sec. 3, 4 and 5, three types of the algorithms, i.e., Exchange Monte Carlo, Simulated Tempering, Multicanonical Monte Carlo, are introduced. In Sec. 6, we give an introduction to Replica Monte Carlo algorithm by Swendsen and Wang. Strategies for the construction of special-purpose extended ensembles are discussed in Sec. 7. We stress that an extension is not necessary restricted to the space of energy or temperature. Even unphysical (unrealizable) configurations can be included in the ensemble, if the resultant fast mixing of the Markov chain offsets the increasing cost of the sampling procedure. Multivari-ate (multi-component) extensions are also useful in many examples. In Sec. 8, we give a survey on extended ensembles with a state space whose dimensionality is dynamically varying. In the appendix, we discuss advantages and disadvantages of three types of extended ensemble algorithms.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Extended Ensemble Monte Carlo

" Extended Ensemble Monte Carlo " is a generic term that indicates a set of algorithms which are now being popular in a variety of fields in physics and statistical information processing. Exchange Monte Carlo (Metropolis-Coupled Chain, Parallel Tempering), Simulated Tempering (Expanded Ensemble Monte Carlo), and Multicanonical Monte Carlo (Adaptive Umbrella Sampling) are typical members of thi...

متن کامل

Non-Boltzmann Ensembles and Monte Carlo Simulations

Boltzmann sampling based on Metropolis algorithm has been extensively used for simulating a canonical ensemble and for calculating macroscopic properties of a closed system at desired temperatures. An estimate of a mechanical property, like energy, of an equilibrium system, is made by averaging over a large number microstates generated by Boltzmann Monte Carlo methods. This is possible because ...

متن کامل

The 0-1 Outcomes Feature Selection Problem : a Chi-2 Approach

This paper addresses the 0-1 outcome feature selection problem. In such a problem, a set of features leads to an outcome that is 0 or 1, depending upon the values of the features. The goal is to extract subsets of features that characterize at best outcome 1. This kind of problem arises in medical analysis, quality control and, generally, in any domain that requires series of expensive tests to...

متن کامل

Stochastic Modelling and Computation Importance Sampling Plays a Crucial Role for Quasi-monte Carlo Methods

8:30 – 8:50 Registration 8:50 – 9:00 Opening Remarks 9:00 – 9:30 Mike Hutchinson, Australian National University Locally adaptive gridding of elevation data 9:30 – 10:00 Malcolm Hudson, Macquarie University Block Fisher scoring optimization of penalized likelihoods in emission tomography 10:00 – 10:40 Alex Smola, NICTA Nonparametric tests for distributions 10:40 – 11:00 Morning Tea 11:00 – 11:4...

متن کامل

The maximum order of a strong matching in a random graph

A strong matching S in a given graph G is a set of disjoint edges {el' e2, ... , em} such that no other edge of the graph G connects an end-vertex of ei with an end-vertex of ej,(ei =Iej). Let Gn,p be the random graph on n vertices with fixed edge probability p, 0 < p < 1. It is shown that, with probability tending to 1 as n ~ 00, the maximum size f3 of a strong matching in Gn,p satisfies where...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001